Eléments de l'association
|  |
List of bibliographic references
Number of relevant bibliographic references: 11.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 006C07 | Ángel J. Gil [Espagne, États-Unis] ; Miki Hermann [France] ; Gernot Salzer [Autriche] ; Bruno Zanuttini [France] | Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains |
| 009E24 | Arnaud Durand [France] ; Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | Subtractive Reductions and Complete Problems for Counting Complexity Classes |
| 00A333 | Miki Hermann [France] ; Laurent Juban [France] ; Phokion G. Kolaitis [États-Unis] | On the complexity of counting the Hilbert basis of a linear Diophantine system |
| 00A959 | Miki Hermann [France] ; Laurent Juban [France] ; Phokion G. Kolaitis [États-Unis] | On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System |
| 00AA28 | Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | Computational Complexity of Simultaneous Elementary Matching Problems |
| 00B613 | Miki Hermann [France] ; Laurent Juban [France] ; Phokion G. Kolaitis [États-Unis] | On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System |
| 00BC30 | Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | On the complexity of unification and disunification in commutative idempotent semigroups |
| 00C004 | Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | Unification algorithms cannot be combined in polynomial time |
| 00C695 | Miki Hermann [États-Unis] ; Phokion G. Kolaitis [États-Unis] | The Complexity of Counting Problems in Equational Matching |
| 00C774 | Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | Computational complexity of simultaneous elementary matching problems |
| 00CC77 | Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | The complexity of counting problems in equational matching |
| This area was generated with Dilib version V0.6.33. |  |